#include <bits/stdc++.h>
using namespace std;
int n;
const int N=100010;
int a[N];
int b[N];
bool c[N];
bool f[N];
void so(int a[N])
{
    int t=1;
    int ind=n+2;
    for(int j=1;j<=n;j++)
    {
        int minn=100010;
        for(int i=1;i<=n;i++)
        {
            if(minn>a[i])
            {
                minn=a[i];
                ind=i;
            }
        }
        b[t]=minn;
        a[ind]=100010;
        t++;
    }
}
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    int sss=1;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
    }
    so(a);
    for(int i=1;i<=n;i++)
    {
        int fl=0;
        for(int j=1;j<=n;j++)
        {
            if(j!=i and f[j]!=1 and fl==0)
            {
                if(b[j]>b[i])
                {
                    f[j]=1;
                    c[i]=1;
                    fl=1;
                }
            }
        }
    }
    int ans=0;
    for(int i=1;i<=n;i++)
    {
        if(c[i]==1)
        {
            ans++;
        }
    }
    cout<<n-ans;
    return 0;
}
